/*
Date:20210417 11:31pm
key:就按题目打就好，没什么特别的
*/
class Solution {
public:
    double dis(int& x1,int &y1, int &x2,int &y2)
    {
        
        return sqrt(pow(x1-x2,2)+pow(y1-y2,2));
    }
    bool F(vector<int>&v1,vector<int>&v2)
    {
        //圆 点
        if(dis(v1[0],v1[1],v2[0],v2[1])<=v1[2])
        {
            return 1;
        }
        else
        {
            return 0;
        }
    }
    vector<int> countPoints(vector<vector<int>>& points, vector<vector<int>>& queries) 
    {
        vector<int>v;
        int count=0;
        for(auto i:queries)
        {
            count=0;
            for(auto j:points)
            {
                F(i,j)==true?count++:0;
            }
            v.push_back(count);
        }
        //cout<<dis(0,0,1,1);
        return v;
    }
};